منابع مشابه
A Type System For Call-By-Name Exceptions
We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type for programs whose execution may raise an exception at top level, and a corruption type for programs that may raise an exception in any evaluation context (not necessarily at top level). We present the syntax and reduction rules of the system, as well as its ...
متن کاملA System F with Call-by-Name Exceptions
We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type A ? ∪{ε} for programs of type A whose execution may raise the exception ε at top level, and a corruption type A{ε} for programs that may raise the exception ε in any evaluation context (not necessarily at top level). We present the syntax and reduction rules ...
متن کاملCall-by-name Gradual Type Theory
We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define the central constructions of gradual typing (the dynamic type, type casts and type error) in a novel way, by universal properties relative to new judgments for gradual type and term dynamism, which were developed in blame calculi and to state the “gradual guarantee” theorem of gradual typing. Comb...
متن کاملCall-by-value isn’t dual to call-by-name, call-by-name is dual to call-by-value!
Gentzen’s sequent calculus for classical logic shows great symmetry: for example, the rule introducing ∧ on the left of a sequent is mirror symmetric to the introduction rule for the dual operator ∨ on the right of a sequent. A consequence of this casual observation is that when Γ ` ∆ is a theorem over operators {∨,∧,¬}, then so is ∆ ` Γ, where Σ reverses the order of formulas in Σ, and exchang...
متن کاملAnswer Type Polymorphism in Call-by-Name Continuation Passing
This paper studies continuations by means of a polymorphic type system. The traditional call-by-name continuation passing style transform admits a typing in which some answer types are polymorphic, even in the presence of first-class control operators. By building on this polymorphic typing, and using parametricity reasoning, we show that the call-by-name transform satisfies the eta-law, and is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2009
ISSN: 1860-5974
DOI: 10.2168/lmcs-5(4:1)2009